TIME-DEPENDENT DISTRIBUTION OF THE WORKLOAD IN M/G/l QUEUES WITH VACATIONS
نویسنده
چکیده
This paper studies a large class of M/C/l queues with vacations. By means of a probabilistic interpretation we obtain a functional equation which gives a unified approach to derive time-dependent results for the workload distribution. We also discuss application of our result to a number vacation models.
منابع مشابه
Queues with Server Vacations and L E′ Vy Processes with Secondary Jump Input
Motivated by models of queues with server vacations, we consider a Le ́vy process modified to have random jumps at arbitrary stopping times. The extra jumps can counteract a drift in the Le ́vy process so that the overall Le ́vy process with secondary jump input, can have a proper limiting distribution. For example, the workload process in an M/G/1 queue with a server vacation each time the server...
متن کاملA sample path analysis of M/GI/1 queues with workload restrictions
A simple random time change is used to analyze M/GI/1 queues with workload restrictions. The types of restrictions considered include workload bounds and rejection of jobs whose waiting times exceed a (possibly random) threshold. Load dependent service rates and vacations are also allowed and in each case the steady state distribution of the workload process for the system with workload restric...
متن کاملThe BMAP/GI/l Queue with Server Set-UpTimes and Server Vacations
PALM-MARTINGALE CALCULUS, QUEUES WITH VACATIONS, BATCH MARKOVIAN ARRIVAL PROCESSES,SERVER SET-UP Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP IGl/1 . queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a custo...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملAnalysis and Computational Algorithm for Queues with State-Dependent Vacations II: M(n)/G/1/K
In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M(n)/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length...
متن کامل